Compact Representation of Elliptic Curve
نویسنده
چکیده
A method is described to represent points on elliptic curves over F 2 n , in the context of elliptic curve cryptosystems, using n bits. The method allows for full recovery of the x and y components of the point. This improves on the naive representation using 2n bits, and on a previously known compressed representation using n + 1 bits. Since n bits are necessary to represent a point in the general case of a cryptosystem over F 2 n , the representation described in this note is minimal.
منابع مشابه
Compact Representation of Elliptic Curve Points over F2n
finite fields, elliptic curves, cryptography A method is described to represent points on elliptic curves over F2n‚ in the context of elliptic curve cryptosystems‚ using n bits. The method allows for full recovery of the x and y components of the point. This improves on the naive representation using 2n bits and on a previously known compressed representation using n + 1 bits. Since n bits are ...
متن کاملCompact Representation of Elliptic Curve Points over F(sub (2 sup n))
finite fields, elliptic curves, cryptography A method is described to represent points on elliptic curves over F2n‚ in the context of elliptic curve cryptosystems‚ using n bits. The method allows for full recovery of the x and y components of the point. This improves on the naive representation using 2n bits and on a previously known compressed representation using n + 1 bits. Since n bits are ...
متن کاملCompact Representation of Domain Parameters of Hyperelliptic Curve Cryptosystems
To achieve the same level of security, hyperelliptic curve cryptosystems (HCC) use a smaller field than elliptic curve cryptosystems (ECC). HCC has a more potential application to the product that has limited memory and computing power, for instance Smart cards. We discussed how to represent the domain parameters of HCC in a compact way. The domain parameters include the field over which the cu...
متن کاملSparse elliptic curve cryptography to improve the electronic payment systems
This paper introduces new techniques and algorithms to reduce the size of the elliptic curve parameters. The basic idea is to use sparse coefficients and sparse base points. The sparse elements are introduced with a compact representation, thus the public key parameters are reduced about 3749 percent. The elliptic curve application such as e-payment and e-commerce can be implemented with better...
متن کاملEfficient Electronic Payment Systems by Using a Sparse Elliptic Curve Cryptography
This paper introduces new techniques and algorithms to reduce the size of the elliptic curve parameters. The basic idea is to use sparse coefficients and sparse base points. The sparse elements are introduced with a compact representation, thus the public key parameters are reduced about 3749 percent. The elliptic curve application such as e-payment and e-commerce can be implemented with better...
متن کامل